Kinetic modeling of pentachlorophenol adsorption from aqueous solution on activated carbon fibers

The adsorption equilibrium data of pentachlorophenol (PCP) onto activated carbon fiber (ACF) in felt form were obtained in a batch adsorber at T = 25 °C and pH 12 and the Langmuir isotherm fitted reasonably well with the experimental data. The rate of adsorption of PCP on ACF was investigated in this work and the experimental concentration decay data were obtained in a differential column batch adsorber. The overall rate of adsorption of PCP was interpreted by a diffusional model that takes into account the external mass transport and intrafiber diffusion. The experimental concentration decay can be described quite well with the diffusional model if the overall rate of adsorption is mainly controlled by intrafiber diffusion and the external mass transport is not important to the overall rate of adsorption. Moreover, intrafiber diffusion was significantly affected by restricted diffusion since the molecular diameter of the PCP was closed to 55% of the average pore diameter. The effect of restricted diffusion was estimated using correlations reported in the literature. The molecules of PCP adsorbed on the surface of the pore also hindered the diffusion of PCP molecules inside the pores.     

Introduction: In-Use,In-Situ: Extending Field Research Methods—Part 2

This study used protocol analyses and user drawings of their models of the system to investigate the “getting lost” problem in hypertext navigation. The “getting lost” problem is viewed as occurring when routine expectations of naive users, concerning appropriate linear sequences, are violated. Several ways in which users persistently attempt to work within a linear model, despite its inapplicability, are examined. The transition to more hierarchical user models is described.     

Fault detection for discrete event systems using Petri nets with unobservable transitions

In this paper we present a fault detection approach for discrete event systems using Petri nets. We assume that some of the transitions of the net are unobservable, including all those transitions that model faulty behaviors. Our diagnosis approach is based on the notions of basis marking and justification, that allow us to characterize the set of markings that are consistent with the actual observation, and the set of unobservable transitions whose firing enable it. This approach applies to all net systems whose unobservable subnet is acyclic. If the net system is also bounded the proposed approach may be significantly simplified by moving the most burdensome part of the procedure off-line, thanks to the construction of a graph, called the basis reachability graph.     

Variants of constrained longest common subsequence

We consider a variant of the classical Longest Common Subsequence problem called Doubly-Constrained Longest Common Subsequence (DC-LCS). Given two strings s₁ and s₂ over an alphabet Σ, a set Cs of strings, and a function Co:Σ→N, the DC-LCS problem consists of finding the longest subsequence s of s₁ and s₂ such that s is a supersequence of all the strings in Cs and such that the number of occurrences in s of each symbol σ∈Σ is upper bounded by Co(σ). The DC-LCS problem provides a clear mathematical formulation of a sequence comparison problem in Computational Biology and generalizes two other constrained variants of the LCS problem that have been introduced previously in the literature: the Constrained LCS and the Repetition-Free LCS. We present two results for the DC-LCS problem. First, we illustrate a fixed-parameter algorithm where the parameter is the length of the solution which is also applicable to the more specialized problems. Second, we prove a parameterized hardness result for the Constrained LCS problem when the parameter is the number of the constraint strings (|Cs|) and the size of the alphabet Σ. This hardness result also implies the parameterized hardness of the DC-LCS problem (with the same parameters) and its NP-hardness when the size of the alphabet is constant.     

ISS feedback control redesign for continuous stirred tank reactors

In this paper a new nonlinear feedback control law for continuous stirred tank reactors, obtained by exact Input/Output (I/O) linearization and Sontag's input‐to‐state stability feedback control redesign methods, is studied. By the new feedback control law, a significant attenuation of the disturbance effect is guaranteed, with evident improvement with respect to control laws obtained by the exact I/O linearization method. The performed simulations validate the theoretical results. Copyright © 2010 John Wiley & Sons, Ltd.     

A characterization of (regular) circular languages generated by monotone complete splicing systems

Circular splicing systems are a formal model of a generative mechanism of circular words, inspired by a recombinant behaviour of circular DNA. Some unanswered questions are related to the computational power of such systems, and finding a characterization of the class of circular languages generated by circular splicing systems is still an open problem. In this paper we solve this problem for monotone complete systems, which are finite circular splicing systems with rules of a simpler form. We show that a circular language L is generated by a monotone complete system if and only if the set Lin(L) of all words corresponding to L is a pure unitary language generated by a set closed under the conjugacy relation. The class of pure unitary languages was introduced by A. Ehrenfeucht, D. Haussler, G. Rozenberg in 1983, as a subclass of the class of context-free languages, together with a characterization of regular pure unitary languages by means of a decidable property. As a direct consequence, we characterize (regular) circular languages generated by monotone complete systems. We can also decide whether the language generated by a monotone complete system is regular. Finally, we point out that monotone complete systems have the same computational power as finite simple systems, an easy type of circular splicing system defined in the literature from the very beginning, when only one rule of a specific type is allowed. From our results on monotone complete systems, it follows that finite simple systems generate a class of languages containing non-regular languages, showing the incorrectness of a longstanding result on simple systems.     

Logic based methods for SNPs tagging and reconstruction

SNPs are positions of the DNA sequences where the differences among individuals are embedded. The knowledge of such SNPs is crucial for disease association studies, but even if the number of such positions is low (about 1% of the entire sequence), the cost to extract the complete information is actually very high. Recent studies have shown that DNA sequences are structured into blocks of positions, that are conserved during evolution, where there is strong correlation among values (alleles) of different loci. To reduce the cost of extracting SNPs information, the block structure of the DNA has suggested to limit the process to a subset of SNPs, the so-called Tag SNPs, that are able to maintain the most of the information contained in the whole sequence. In this paper, we apply a technique for feature selection based on integer programming to the problem of Tag SNP selection. Moreover, to test the quality of our approach, we consider also the problem of SNPs reconstruction, i.e. the problem of deriving unknown SNPs from the value of Tag SNPs and propose two reconstruction methods, one based on a majority vote and the other on a machine learning approach. We test our algorithm on two public data sets of different nature, providing results that are, when comparable, in line with the related literature. One of the interesting aspects of the proposed method is to be found in its capability to deal simultaneously with very large SNPs sets, and, in addition, to provide highly informative reconstruction rules in the form of logic formulas.     

Matrix-Based Discrete Event Control for Surveillance Mobile Robotics

This paper focuses on the control system for an autonomous robot for the surveillance of indoor environments. Our approach proposes a matrix-based formalism which allows us to merge in a single framework discrete-event supervisory control, conflict resolution and reactive control. As a consequence, the robot is able to autonomously handle high level tasks as well as low-level behaviors, solving control and decision-making issues simultaneously. Moreover, the matrix-based controller is modular and can be easily reconfigured if mission characteristics or robot hardware configuration change. An illustrative example and a report on experimental investigations are provided to illustrate the main features of the proposed approach.